Parallel matching for ranking all teams in a tournament
نویسندگان
چکیده
We propose a simple and efficient scheme for ranking all teams in a tournament, where matches can be played simultaneously. We show that the distribution of the number of rounds of the proposed scheme can be derived by lattice path counting techniques used in ballot problems. We also discuss our method from the viewpoint of parallel sorting algorithms.
منابع مشابه
Ela on the Brualdi-li Matrix and Its Perron Eigenspace
The n × n Brualdi-Li matrix Bn has recently been shown to have maximal Perron value (spectral radius) ρ among all tournament matrices of even order n, thus settling the conjecture by the same name. This renews our interest in estimating ρ and motivates us to study the Perron eigenvector x of Bn, which is normalized to have 1-norm equal to one. It follows that x minimizes the 2-norm among all Pe...
متن کاملMajority Voting in Stable Marriage Problem with Couples
Providing centralised matching services can be viewed as a group decision support system (GDSS) for the participants to reach a stable matching solution. In the original stable marriage problem all the participants have to rank all members of the opposite party. Two variations for this problem allow for incomplete preference lists and ties in preferences. If members from one side are allowed to...
متن کاملRandom tournaments: who plays with whom and how many times?
The weighted feedback arc set problem on tournaments (WFAS-T) is defined by a weighted tournament graph whose nodes represents the teams/items, and the goal is to find a ranking over the teams that minimizes the sum of the weights of the feedback arcs. We consider the probabilistic version of WFAS-T, in which the weights of the directed edges between every pair of teams sum up to one. A WFAS-T ...
متن کاملThe Role of Simulation in Sports Tournament Design for Game Sport
There are m any alternative stru ctures to tournaments for gam e sports and over time tournaments have revised their st ructures. In m aking a revision to a tournament structure, there will be de sirable characteristics that must be maintained or im proved. Such c haracteristics include accurately ranking the strongest teams, increased revenue from audiences and sponsors and m aintaining or imp...
متن کاملBracketology: How can math help?
Every year, people across the United States predict how the field of 65 teams will play in the Division I NCAA Men’s Basketball Tournament by filling out a tournament bracket for the postseason play. This article discusses two popular rating methods that are also used by the Bowl Championship Series, the organization that determines which college football teams are invited to which bowl games. ...
متن کامل